#include <iostream>
#include "./util/dynamic-search.h"
#include "./util/hash-table.h"

using namespace std;

void print(NodeDateType &e)
{
	cout << (int)e << " ";
}

int main()
{
	// BinTree tree;
	// NodeDateType data[] = {62, 88, 58, 47, 35, 73, 51, 99, 37, 93};
	// createSortTree(tree, data, 10);
	// cout << "前序遍历：";
	// preOrderTraverse(tree, print);
	// cout << endl;
	// cout << "中序遍历：";
	// inOrderTraverse(tree, print);
	// cout << endl;
	HashTable table;
	initHashTable(table);
	putTable(table, 320);
	putTable(table, 5);
	putTable(table, 13);
	cout << getTable(table, 5) << endl;
	cout << getTable(table, 13) << endl;
	cout << getTable(table, 320) << endl;
	cout << getTable(table, 123) << endl;
}